منابع مشابه
Some properties of k-trees
Abstract. Let k ≥ 2 be an integer. We investigate hamiltonian properties for a k-tree G, a special chordal graph. Instead of studying the toughness condition motivated by a conjecture of Chvátal, we introduce a new parameter, the branch number of G, denoted by β(G). Some results on the relationships between β(G) and other graph parameters will be presented. A path system of G is a subgraph whos...
متن کاملSome Results on Metric Trees
Using isometric embedding of metric trees into Banach spaces, this paper will investigate barycenters, type and cotype, and various measures of compactness of metric trees. A metric tree (T , d) is a metric space such that between any two of its points there is an unique arc that is isometric to an interval in R. We begin our investigation by examining isometric embeddings of metric trees into ...
متن کاملEnumeration of Some Labelled Trees
In this paper we are interesting in the enumeration of rooted labelled trees according to the relationship between the root and its sons. Let Tn;k be the family of Cayley trees on n] such that the root has exactly k smaller sons. In a rst time we give a bijective proof of the fact that jTn+1;kj = ? n k n n?k. Moreover, we use the family Tn+1;0 of Cayley trees for which the root is smaller than ...
متن کاملOn some varieties associated with trees
This article considers some affine algebraic varieties attached to finite trees and closely related to cluster algebras. Their definition involves a canonical coloring of vertices of trees into three colors. These varieties are proved to be smooth and to admit sometimes free actions of algebraic tori. Some results are obtained on their number of points over finite fields and on their cohomology.
متن کاملSome Bounds on Alliances in Trees
Given a simple graph G = (V,E), a subset S of the vertices is called a global defensive alliance if S is a dominating set and for every vertex v in S at least half of the vertices in the closed neighborhood of v are in S. Similarly, a subset S is called a global offensive alliance if S is a dominating set and for every vertex v not in S at least half of the vertices in the closed neighborhood o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Science
سال: 1887
ISSN: 0036-8075,1095-9203
DOI: 10.1126/science.ns-9.223.462